Definability as hypercomputational effect
نویسندگان
چکیده
منابع مشابه
Definability as hypercomputational effect
The classical simulation of physical processes using standard models of computation is fraught with problems. On the other hand, attempts at modelling real-world computation with the aim of isolating its hypercomputational content have struggled to convince. We argue that a better basic understanding can be achieved through computability theoretic deconstruction of those physical phenomena most...
متن کاملDefinability as hypercomputational effect q
The classical simulation of physical processes using standard models of computation is fraught with problems. On the other hand, attempts at modelling real-world computation with the aim of isolating its hypercomputational content have struggled to convince. We argue that a better basic understanding can be achieved through computability theoretic deconstruction of those physical phenomena most...
متن کاملA hypercomputational alien
Is there a physical constant with the value of the halting function? An answer to this question, as in other discussions of hypercomputation, assumes a fixed interpretation of nature by mathematical entities. Without agreeing on such an interpretation, the question is without context and meaningless. We discuss the subjectiveness of viewing the mathematical properties of nature, and the possibi...
متن کاملA possible hypercomputational quantum algorithm
The term ‘hypermachine’ denotes any data processing device (theoretical or that can be implemented) capable of carrying out tasks that cannot be performed by a Turing machine. We present a possible quantum algorithm for a classically non-computable decision problem, Hilbert’s tenth problem; more specifically, we present a possible hypercomputation model based on quantum computation. Our algorit...
متن کاملGap-Definability as a Closure Property
Gap-definability and the gap closure operator were defined by S. Fenner, L. Fortnow and S. Kurth (J. Comput. System Sci. 48, 116 148 (1994)). Few complexity classes were known at that time to be gapdefinable. In this paper, we give simple characterizations of both gapdefinability and the gap-closure operator, and we show that many complexity classes are gap-definable, including P, P, PSPACE, EX...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics and Computation
سال: 2006
ISSN: 0096-3003
DOI: 10.1016/j.amc.2005.09.072